Integer and combinatorial optimization

Interior Point Methods for Combinatorial Optimization

Research on using interior point algorithms to solve combinatorial optimization and integer programming problems is surveyed. This paper discusses branch and cut methods for integer programming problems, a potential reduction method based on transforming an integer programming problem to an equivalent nonconvex quadratic programming problem, interior point methods for solving network flow probl...

A Large Scale Integer and Combinatorial Optimizer

The topic of this thesis, integer and combinatorial optimization, involves minimizing (or maximizing) a function of many variables, some of which belong to a discrete set, subject to constraints. This area has abundant applications in industry. Integer and combinatorial optimization problems are often difficult to solve due to the large and complex set of alternatives. The objective of this the...

Myths and Counterexamples in Integer Programming and Combinatorial Optimization

Combinatorial Optimization and Integer Programming

Short contents list

Effective integrations of constraint programming, integer programming and local search for two combinatorial optimisation problems

......................................................................................................................... vii Acknowledgements ........................................................................................................ ix Chapter

Handbook of Combinatorial Optimization Grr Obner Bases in Integer Programming